Symmetric cubic graphs with solvable automorphism groups
نویسندگان
چکیده
منابع مشابه
On minimal symmetric automorphism groups of finite symmetric graphs
Let r be finite connected and G a group of automorphisms of r which is transitive on vertices. Suppose that, for a vertex 0 of r, S ~ G~(O') ::; Aut S for some simple group S with S acting primitively on the set r( a) of neighbours of 0, and suppose that G is minimal with these properties. Then one of: (i) G is a nonabelian simple group, (ii) r is a Cayley graph for a normal subgroup N of G and...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملAutomorphism groups of graphs
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets. Keywords—Automorphism groups of graphs; Cayley graphs; transposition sets.
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملGeometric automorphism groups of graphs
Constructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method for drawing graphs symmetrically based on group theory. More formally, we define an n-geometric automorphism group as a subgroup of the automorphism group of a graph that can be displayed as symmetries of a drawing of the graph in n dimensions. Then we present an algorithm to find all 2and 3-geometric a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2015
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2014.10.008